Does Online Information Drive Offline Revenues?
نویسندگان
چکیده
منابع مشابه
Does Online Information Drive Offline Revenues?: Only for Specific Products and Consumer Segments!
Koen Pauwels a,∗, Peter S.H. Leeflang b, Marije L. Teerling c,1, K.R. Eelko Huizingh d a Ozyegin University, Kusbakisi Street 2, 34662 Altunizade, Üsküdar, İstanbul, Turkey b Marketing Department of University of Groningen, Faculty of Economics and Business, The Netherlands c Telematica Instituut, P.O. Box 589, 7500 AN Enschede, The Netherlands d Department of Business Development, Faculty of E...
متن کاملDoes Asymmetric Information Drive Capital Structure Decisions?
Using a novel information asymmetry index based on measures of adverse selection developed by the market microstructure literature, we test whether information asymmetry is an important determinant of capital structure decisions, as suggested by the pecking order theory. Our index relies exclusively on measures of the market’s assessment of adverse selection risk rather than on ex ante firm cha...
متن کاملOffline to Online Conversion
We consider the problem of converting offline estimators into an online predictor or estimator with small extra regret. Formally this is the problem of merging a collection of probability measures over strings of length 1,2,3,... into a single probability measure over infinite sequences. We describe various approaches and their pros and cons on various examples. As a side-result we give an elem...
متن کاملOnline Appendix: Ideological Segregation Online and Offline
In table 2 we present standard errors for our main estimates. For estimates that come from MRI, the GSS or the CNES, we compute standard errors through a nonparametric bootstrap over samples of respondents. For estimates that come from comScore aggregate data, that is not an option. Instead we perform a parametric bootstrap in which we model the share conservative of each website as an independ...
متن کاملMaximizing Revenues for Online-Dial-a-Ride
In the classic Dial-a-Ride Problem, a server travels in some metric space to serve requests for rides. Each request has a source, destination, and release time. We study a variation of this problem where each request also has a revenue that is earned if the request is satisfied. The goal is to serve requests within a time limit such that the total revenue is maximized. We first prove that the v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Retailing
سال: 2011
ISSN: 0022-4359
DOI: 10.1016/j.jretai.2010.10.001